The Narrow Capture Problem with Partially Absorbing Targets and Stochastic Resetting

نویسندگان

چکیده

We consider a particle undergoing diffusion with stochastic resetting in bounded domain for . The is perforated by set of partially absorbing spherical targets within which the may be absorbed at rate Each target assumed to much smaller than , allows us use asymptotic and Green’s function methods solve equation Laplace space. In particular, we construct an inner solution interior local exterior each match it outer bulk This yields expansion transformed flux into powers respectively, where nondimensionalized size. fluxes determine how mean first passage time (MFPT) absorption depends on reaction For range parameter values, MFPT unimodal minimum optimal that configuration.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Diffusion with stochastic resetting.

We study simple diffusion where a particle stochastically resets to its initial position at a constant rate r. A finite resetting rate leads to a nonequilibrium stationary state with non-Gaussian fluctuations for the particle position. We also show that the mean time to find a stationary target by a diffusive searcher is finite and has a minimum value at an optimal resetting rate r*. Resetting ...

متن کامل

Learning with Partially Absorbing Random Walks

We propose a novel stochastic process that is with probability αi being absorbed at current state i, and with probability 1 − αi follows a random edge out of it. We analyze its properties and show its potential for exploring graph structures. We prove that under proper absorption rates, a random walk starting from a set S of low conductance will be mostly absorbed in S. Moreover, the absorption...

متن کامل

Network Location Problem with Stochastic and Uniformly Distributed Demands

This paper investigates the network location problem for single-server facilities that are subject to congestion. In each network edge, customers are uniformly distributed along the edge and their requests for service are assumed to be generated according to a Poisson process. A number of facilities are to be selected from a number of candidate sites and a single server is located at each facil...

متن کامل

Competitive Vehicle Routing Problem with Time Windows and Stochastic Demands

The competitive vehicle routing problem is one of the important issues in transportation area. In this paper a new method for competitive VRP with time windows and stochastic demand is introduced. In the presented method a three time bounds are given and the probability of arrival time between each time bound is assumed to be uniform. The demands of each customer are different in each time wind...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Multiscale Modeling & Simulation

سال: 2022

ISSN: ['1540-3459', '1540-3467']

DOI: https://doi.org/10.1137/21m1449580